Modules with reducible complexity
نویسندگان
چکیده
منابع مشابه
Modules with Reducible Complexity
For a commutative Noetherian local ring we define and study the class of modules having reducible complexity, a class containing all modules of finite complete intersection dimension. Various properties of this class of modules are given, together with results on the vanishing of homology and cohomology.
متن کاملModules with Reducible Complexity, Ii
We continue studying the class of modules having reducible complexity over a local ring. In particular, a method is provided for computing an upper bound of the complexity of such a module, in terms of vanishing of certain cohomology modules. We then specialize to complete intersections, which are precisely the rings over which all modules have finite complexity.
متن کاملReducible Complexity in Dns
DNS is one of the most important components of the Internet infrastructure. Unfortunately, it is known to be difficult to implement, and available implementations are difficult to configure correctly. DNS performance and availability often suffer from poor configuration which leads to unavailability or erroneous behavior of distributed systems that depend on DNS. The data structures of DNS are ...
متن کاملMaximizing Fun by Creating Data with Easily Reducible Subjective Complexity
The Formal Theory of Fun and Creativity (1990–2010) [Schmidhuber, J.: Formal theory of creativity, fun, and intrinsic motivation (1990–2010). IEEE Trans. Auton. Mental Dev. 2(3), 230–247 (2010b)] describes principles of a curious and creative agent that never stops generating nontrivial and novel and surprising tasks and data. Two modules are needed: a data encoder and a data creator. The forme...
متن کاملNon-reducible Descriptions for Conditional Kolmogorov Complexity
Assume that a program p on input a outputs b. We are looking for a shorter program q having the same property (q(a) = b). In addition, we want q to be simple conditional to p (this means that the conditional Kolmogorov complexity K (q|p) is negligible). In the present paper, we prove that sometimes there is no such program q, even in the case when the complexity of p is much bigger than K (b|a)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2007
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2006.09.008